Reasoning about Hierarchical Storage
نویسندگان
چکیده
In this paper, we develop a new substructural logic that can encode invariants necessary for reasoning about hierarchical storage. We show how the logic can be used to describe the layout of bits in a memory word, the layout of memory words in a region, the layout of regions in an address space, or even the layout of address spaces in a multiprocessing environment. We provide a semantics for our formulas and then apply the semantics and logic to the task of developing a type system for Mini-KAM, a simplified version of the abstract machine used in the ML Kit with regions.
منابع مشابه
Improving Data Grids Performance by Using Modified Dynamic Hierarchical Replication Strategy
Abstract: A Data Grid connects a collection of geographically distributed computational and storage resources that enables users to share data and other resources. Data replication, a technique much discussed by Data Grid researchers in recent years creates multiple copies of file and places them in various locations to shorten file access times. In this paper, a dynamic data replication strate...
متن کاملHierarchical Reasoning with Probabilistic Programming
Hierarchical representations are common in many artificial intelligence tasks, such as classification of satellites in orbit. Representing and reasoning on hierarchies is difficult, however, as they can be large, deep and constantly evolving. Although probabilistic programming provides the flexibility to model many situations, current probabilistic programming languages (PPL) do not adequately ...
متن کاملHierarchical Information Maps
We discuss the problems of spatio-temporal reasoning in the context of hierarchical information maps and approximate reasoning networks (AR networks). Hierarchical information maps are used for representation of domain knowledge about objects, their parts, and their dynamical changes. They are constructed out of information maps connected by some spatial relations. Each map describes changes (e...
متن کاملOn automated reasoning about recursively defined functions and homomorphisms
We study possibilities of reasoning about extensions of base theories with functions which satisfy certain recursion (or homomorphism) properties. Our focus is on emphasizing possibilities of hierarchical and modular reasoning in such extensions and combinations thereof. We present practical applications in verification and cryptography.
متن کاملHierarchical Reasoning in Probabilistic CSPKaren
Probabilistic CSP extends the language of CSP with an operator for probabilis-tic choice. However reasoning about an intricate combination of nondeterminism, communication and probabilistic behaviour can be complicated. In standard CSP such complication is overcome (when possible) by use of hierarchical reasoning. In this paper we provide a foundation for lifting such reasoning to the probabili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003